New bounds on the minimum calls of failure-tolerant gossiping
نویسندگان
چکیده
Gossiping is an extensively investigated information dissemination process. In gossiping, every vertex holds a message which has to be transmitted to all other vertices. This paper deals with k-failure tolerant gossiping, which investigates the minimum number of transmissions (calls) required by the communication process, provided that at most k transmissions may fail. We show new bounds for the number of transmissions, which are better than the previous results if k is sufficiently large. In addition, some examples of k-failure tolerant gossiping with fewer transmissions are shown for small graphs. Keywoards:Communication network; Gossiping; Reliability
منابع مشابه
Better Bounds for Perpetual Gossiping
In the perpetual gossiping problem, introduced by Liestman and Richards, information may be generated at any time and at any vertex of a graph G; adjacent vertices can communicate by telephone calls. We define Wk(G) to be the minimum w such that, placing at most k calls each time unit, we can ensure that every piece of information is known to every vertex within w time units of its generation. ...
متن کاملLength and Number of Buses for Gossiping in Networks
Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all the other nodes A bus network is a network of processing elements that communicate by sending messages along buses in a sequence of calls We assume that i each node can participate to at most one call at a time ii a node can either rea...
متن کاملReordered gossip schemes
This paper presents a new theorem called the reordering theorem for the problem of gossiping by telephone. The theorem says the calls of any complete gossiping can be rearranged into a sequence such that at most two calls cause each participant to become fully informed, and such that the reverse of this sequence has the same property. This theorem has broad consequences. Several results from th...
متن کاملA study of minimum gossip graphs
Gossiping and broadcasting are two problems of information dissemination described in a group of individuals connected by a communication network. In broadcasting, one individual has an item of information and needs to communicate it to everyone else. In gossiping, every person in the network knows a unique item of information and needs to communicate it to everyone else. Those two communicatio...
متن کاملNew bounds on proximity and remoteness in graphs
The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006